منابع مشابه
Task Ordering in Linear Tiles
In this report we address the issue of loop tiling to minimize the completion time of the loop when executed on multicomputers We remove the restriction of atomicity of tiles and internal parallelism within tiles is exploited by overlapping computation with communication The e ectiveness of tiling is then critically dependent on the execution order of tasks within a tile In this paper we presen...
متن کاملOperator Ordering in Quantum Radiative Processes
In this work we reexamine quantum electrodynamics of atomic electrons in the Coulomb gauge in the dipole approximation and calculate the shift of atomic energy levels in the context of Dalibard, Dupont-Roc and CohenTannoudji (DDC) formalism by considering the variation rates of physical observable. We then analyze the physical interpretation of the ordering of operators in the dipole approximat...
متن کاملPersistent Spins in the Linear Diffusion Approximation of Phase Ordering and Zeros of Stationary Gaussian Processes.
The fraction r(t) of spins which have never flipped up to time t is studied within a linear diffusion approximation to phase ordering. Numerical simulations show that, even in this simple context, r(t) decays with time like a power-law with a non-trival exponent θ which depends on the space dimension. The local dynamics at a given point is a special case of a stationary gaussian process of know...
متن کاملPartial ordering in theory of stochastic processes.
14A sample of thymidine was kindly furnished by Dr. E. E. Snell. 16 Stokstad, E. L. R., J. Biol. Chem., 139, 475 (1941). 16 Stokes, J. L., J. Bact., 48, 201 (1944). 17 Snell, E. E., and Mitchell, H. K., PROC. NATL. ACAD. ScI., 27, 1 (1941). 18 Barnes, F. W., and Schoenheimer, R., J. Biol. Chem., 151, 123 (1943). 19 Sonne, J. C., Buchanan, J. M., and Deluva, A. M., Ibid., 173, 69 (1948). 2 Bucha...
متن کاملApproximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental Psychology: Learning, Memory, and Cognition
سال: 2016
ISSN: 1939-1285,0278-7393
DOI: 10.1037/xlm0000220